A Compact Coprocessor for the Elliptic Curve Point Multiplication over Gaussian Integers
نویسندگان
چکیده
منابع مشابه
Elliptic Curve Point Multiplication
New type of elliptic curve point multiplication is proposed, where complex multiplication by 2 − or by 2 ) 7 1 ( − ± is used instead of point duplication. This allows speeding up multiplication about 1.34 times. Using higher radix makes it possible to use one point duplication instead of two and to speed-up computation about 1.6 times. The method takes prime group order factorization: ρ ρ = r a...
متن کاملA Compact Architecture for Montgomery Elliptic Curve Scalar Multiplication Processor
We propose a compact architecture of a Montgomery elliptic curve scalar multiplier in a projective coordinate system over GF (2). To minimize the gate area of the architecture, we use the common Z projective coordinate system where a common Z value is kept for two elliptic curve points during the calculations, which results in one register reduction. In addition, by reusing the registers we are...
متن کاملVHDL Implementation using Elliptic Curve Point Multiplication
This paper describes synthesizable VDHL implementation of elliptic curve Point Multiplication. Elliptic curves used for ECC are defined over mathematical structures called Galois fields. Based on the theory of ECC, this paper has carried out Modular addition/subtraction, EC Point doubling/addition, Modular multiplicative inversion, EC point multiplier, projective to affine coordinates conversio...
متن کاملElliptic Curve Point Multiplication Algorithm Using Precomputation
Window-based elliptic curve multiplication algorithms are more attractive than non-window techniques if precomputation is allowed. Reducing the complexity of elliptic curve point multiplication of the form , which is the dominant operation in elliptic curve cryptography schemes, will reduces the overall complexity of the cryptographic protocol. The wBD is a new window-based elliptic curve multi...
متن کاملElliptic Curve Point Multiplication Using MBNR and Point Halving
-----------------------------------------------------------------------ABSTRACT---------------------------------------------------------The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. As generalization of double base number system of a number k to multi-base number system (MBNR) provides a faster method for the scalar multipl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2020
ISSN: 2079-9292
DOI: 10.3390/electronics9122050